Finding Maximum Cliques on Circular-Arc Graphs
نویسندگان
چکیده
An algorithm is presented that, given the intersection model S of a circular-arc graph G with n vertices and m edges. finds a maximum-sized clique of GinO (n21oglogn) time. The previously best time bound for this problem is 0 (n 21ogn + mn). • 1ltis work was supported by Ihe Office of Naval Research under Conr:racr.s NOOOl4-84-K-DS02 and NOOOl4-86-K-0689. and by the National Science Foundation underGranl DMC-84-13496.
منابع مشابه
About maximal cliques in a certain class of circular-arc graphs
In this paper we address the problem of finding all maximal cliques in a subclass of circular-arc graphs. We consider only circular-arc graphs that are generated with an arc model where no three arcs cover the whole circle. We prove that the number of maximal cliques is bounded by the number of vertices and that for each maximal clique it exists a point in the circle which is covered by all arc...
متن کاملAlgorithms for clique-independent sets on subclasses of circular-arc graphs
A circular-arc graph is the intersection graph of arcs on a circle. A Helly circular-arc graph is a circular-arc graph admitting a model whose arcs satisfy the Helly property. A clique-independent set of a graph is a set of pairwise disjoint cliques of the graph. It is NP-hard to compute the maximum cardinality of a clique-independent set for a general graph. In the present paper, we propose po...
متن کاملClique-independent sets of Helly circular-arc graphs
A circular-arc graph is the intersection graph of arcs of a circle. A Helly circular-arc graph is a circular-arc graph admitting a model whose arcs satisfy the Helly property. A clique-independent set of a graph is a set of pairwise disjoint cliques of the graph. It is NP-hard to compute the maximum cardinality of a clique-independent set for a general graph. In the present paper, we propose al...
متن کاملPartial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. A graph G is clique-perfect if the sizes of a minimum clique-transversal and a maximum clique-independent set are equal for every induced subgraph ofG. The list of minimal forbidden induced subgraphs for the class of clique-perf...
متن کاملThe clique operator on circular-arc graphs
A circular-arc graph G is the intersection graph of a collection of arcs on the circle and such a collection is called a model of G. Say that the model is proper when no arc of the collection contains another one, it is Helly when the arcs satisfy the Helly Property, while the model is proper Helly when it is simultaneously proper and Helly. A graph admitting a Helly (resp. proper Helly) model ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 26 شماره
صفحات -
تاریخ انتشار 1987